Minimum Transversals in Posimodular Systems
نویسندگان
چکیده
منابع مشابه
Minimum Transversals in Posi-modular Systems
Given a system (V, f, d) on a finite set V consisting of two set functions f : 2 → R and d : 2 → R, we consider the problem of finding a set R ⊆ V of minimum cardinality such that f(X) ≥ d(X) for all X ⊆ V − R, where the problem can be regarded as a natural generalization of the source location problems and the external network problems in (undirected) graphs and hypergraphs. We give a structur...
متن کاملMinimum polygon transversals of line segments
Let S be used to denote a nite set of planar geometric objects. Deene a polygon transversal of S as a closed simple polygon that simultaneously intersects every object in S, and a minimum polygon transversal of S as a polygon transversal of S with minimum perimeter. If S is a set of points then the minimum polygon transversal of S is the convex hull of S. However, when the objects in S have som...
متن کاملExact algorithms for finding minimum transversals in rank-3 hypergraphs
We present two algorithms for the problem of nding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem. This problem is a natural extension of the vertex cover problem for ordinary graphs. The rst algorithm runs in time O(1:6538 n) for a hypergraph with n vertices, and needs polynomial space. The second algorithm uses exponential space and runs in time O(1:6...
متن کاملMinimum d-blockers and d-transversals in graphs
We consider a set V of elements and an optimization problem on V : the search for a maximum (or minimum) cardinality subset of V verifying a given property P. A d-transversal is a subset of V which intersects any optimum solution in at least d elements while a d-blocker is a subset of V whose removal deteriorates the value of an optimum solution by at least d. We present some general characteri...
متن کاملPosimodular Function Optimization
Given a posimodular function f : 2 → R on a finite set V , we consider the problem of finding a nonempty subsetX of V that minimizes f(X). Posimodular functions often arise in combinatorial optimization such as undirected cut functions. In this paper, we show that any algorithm for the problem requires Ω(2 n 7.54 ) oracle calls to f , where n = |V |. It contrasts to the fact that the submodular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2009
ISSN: 0895-4801,1095-7146
DOI: 10.1137/060663970